Search Strategies for Theorem - Proving
نویسنده
چکیده
We will define the notions of abstract theorem-proving graph, abstract theorem-proving problem g and search strategy E for g. These concepts generalize the usual tree (or graph) searching problem and admit Hart, Nilsson and Raphael (1968) and Pohl (1969) theories of heuristic search. In particular the admissibility and optimality theorems of Hart, Nilsson and Raphael generalize for the classes 0 and 0" of diagonal search strategies for abstract theorem-proving problems. In addition the subclass au of 0 is shown to be optimal for 2. Implementation of diagonal search is treated in some detail for theorem-proving by resolution rules (Robinson 1965).
منابع مشابه
A Taxonomy of Theorem-Proving Strategies
This article presents a taxonomy of strategies for fully-automated general-purpose first-order theorem proving. It covers forwardreasoning ordering-based strategies and backward-reasoning subgoal-reduction strategies, which do not appear together often. Unlike traditional presentations that emphasize logical inferences, this classification strives to give equal weight to the inference and searc...
متن کاملOn the Modelling of Search in Theorem Proving - Towards a Theory of Strategy Analysis
We present a model for representing search in theorem proving. This model captures the notion of contraction, which has been central in some of the recent developments in theorem proving. We outline an approach to measuring the complexity of search which can be applied to analyze and evaluate the behaviour of theorem-proving strategies. Using our framework, we compare contraction-based strategi...
متن کاملAnd-or Graphs, Theorem-proving Graphs and Bi-directional Search
And-or graphs and theorem-proving graphs determine the same kind of search space and differ only in the direction of search: from axioms to goals, in the case of theorem-proving graphs, and in the opposite direction, from goals to axioms, in the case of and-or graphs. Bi-directional search strategies combine both directions of search. We investigate the construction of a single general algorith...
متن کاملThe Search Eeciency of Theorem Proving Strategies: an Analytical Comparison K I N F O R M a T I K Im Stadtwald D 66123 Saarbr Ucken Germany Authors' Addresses Publication Notes
We analyze the search e ciency of a number of common refutational theorem proving strategies for rst-order logic. Search e ciency is concerned with the total number of proofs and partial proofs generated, rather than with the sizes of the proofs. We show that most common strategies produce search spaces of exponential size even on simple sets of clauses, or else are not sensitive to the goal. H...
متن کاملStrategy Parallelism in Automated Theorem Proving
Automated theorem provers use search strategies. Unfortunately, there is no unique strategy which is uniformly successfifl on "all problems. A combination of more thmx one strategy increases the chances of success. Limitations of resources m~ time or processors enforce efficient use of these resources by partitioning the resources adequately among thc involved strategies. This leads to an optim...
متن کامل